| 1. | The most important concepts of domain theory will nonetheless be introduced below.
|
| 2. | A fundamental theorem of computational domain theory is that if "'progression "'
|
| 3. | Directed subsets are used in domain theory, which studies directed complete partial orders.
|
| 4. | For example, the domain theory for chess is simply the rules of chess.
|
| 5. | Such posets which are dcpos are much used in domain theory.
|
| 6. | Beside these desirable properties, domain theory also allows for an appealing intuitive interpretation.
|
| 7. | This occurs for example in domain theory, where function spaces play an important role.
|
| 8. | In this section, the central concepts and definitions of domain theory will be introduced.
|
| 9. | In domain theory, one often deals with so-called Scott-continuous functions that preserve all directed suprema.
|
| 10. | Domain theory is a purely " qualitative " approach to modeling the structure of information states.
|